FAQ on π-Calculus
نویسنده
چکیده
Let P and Q denote processes. Then • P | Q denotes a process composed of P and Q running in parallel. • a(x).P denotes a process that waits to read a value x from the channel a and then, having received it, behaves like P. • ā〈x〉.P denotes a process that first waits to send the value x along the channel a and then, after x has been accepted by some input process, behaves like P. • (νa)P ensures that a is a fresh channel in P. (Read the Greek letter “nu” as “new.”) • !P denotes an infinite number of copies of P, all running in parallel. • P + Q denotes a process that behaves like either P or Q. • 0 denotes the inert process that does nothing.
منابع مشابه
Comparing the Expressive Power of the Synchronous and the Asynchronous π-calculi
The Asynchronous π-calculus, proposed by Honda and Tokoro (1991) and, independently, by Boudol (1992), is a subset of the π-calculus (Milner et al., 1992) which contains no explicit operators for choice and output-prefixing. The communication mechanism of this calculus, however, is powerful enough to simulate output-prefixing, as shown by Honda and Tokoro (1991) and by Boudol (1992), and input-...
متن کاملComparing The Expressive Power Of The Synchronous And Asynchronous Pi-Calculi
The Asynchronous π-calculus, proposed by Honda and Tokoro (1991) and, independently, by Boudol (1992), is a subset of the π-calculus (Milner et al., 1992) which contains no explicit operators for choice and output-prefixing. The communication mechanism of this calculus, however, is powerful enough to simulate output-prefixing, as shown by Honda and Tokoro (1991) and by Boudol (1992), and input-...
متن کاملA Survey on π - Calculus
Calculus is the mathematical study of change. Process Calculus models the changing behavior of computer processes. Usually a process refers to a running program. λcalculus is a form of process calculus that has been heavily used in the functional programming arena. While, λ-calculus model changes in sequential computer processes, π-calculus formalizes behavior of a concurrent process. In this p...
متن کاملThe Attributed Pi-Calculus with Priorities
We present the attributed π-calculus for modeling concurrent systems with interaction constraints depending on the values of attributes of processes. The λ-calculus serves as a constraint language underlying the π-calculus. Interaction constraints subsume priorities, by which to express global aspects of populations. We present a nondeterministic and a stochastic semantics for the attributed π-...
متن کاملVerifying π-calculus Processes by Promela Translation
In this paper, the possibility of verifying π-calculus processes via Promela translation is investigated. A general translation method from π-calculus processes to Promela models is presented and its usefulness is shown by performing verification tasks with translated π-calculus examples and SPIN. Model checking translated π-calculus processes in SPIN is shown to overcome shortcomings of the Mo...
متن کامل